Finitary Partial Inductive Definitions as a General Logic
نویسنده
چکیده
We describe how the calculus of partial inductive definitions is used to represent logics. This calculus includes the powerful principle of definitional reflection. We describe two conceptually different approaches to representing a logic, both making essential use of definitional reflection. In the deductive approach, the logic is defined by its inference rules. Only the succedent rules (in a sequent calculus setting – introduction rules in a natural deduction setting) need be given. The other rules are obtained implicitly using definitional reflection. In the semantic approach, the logic is defined using its valuation function. The latter approach often provides a more straightforward representation of logics with simple semantics but complicated proof systems.
منابع مشابه
A Finitary Version of the Calculus of Partial Inductive Defintions
The theory of partial inductive definitions is a mathematical formalism which has proved to be useful in a number of different applications. The fundamentals of the theory is shortly described. Partial inductive definitions and their associated calculi are essentially infinitary. To implement them on a computer, they must be given a formal finitary representation. We present such a finitary rep...
متن کاملPi: an Interactive Derivation Editor for the Calculus of Partial Inductive Definitions
Pi is a system for the interactive construction and editing of formal derivations in the calculus of finitary partial inductive definitions. This calculus can be used as a logical framework where object logics are specified, turning Pi into a derivation system for a particular object logic. Noteworthy features of Pi include: a graphic user interface where derivations are presented in tree form,...
متن کاملOn the complexity of inductive definitions
We study the complexity of computable and Σ1 inductive definitions of sets of natural numbers. For we example, we show how to assign natural indices to monotone Σ1-definitions and we use these to calculate the complexity of the set of all indices of monotone Σ1-definitions which are computable. We also examine the complexity of a new type of inductive definition which we call weakly finitary mo...
متن کاملCyclic Proofs for First-Order Logic with Inductive Definitions
We consider a cyclic approach to inductive reasoning in the setting of first-order logic with inductive definitions. We present a proof system for this language in which proofs are represented as finite, locally sound derivation trees with a “repeat function” identifying cyclic proof sections. Soundness is guaranteed by a well-foundedness condition formulated globally in terms of traces over th...
متن کاملA note on the theory SID<ω of stratified induction
We introduce and analyse a theory of finitely stratified general inductive definitions over the natural numbers, SID<ω, and establish its proof-theoretic ordinal, φε0(0). The definition of SID<ω bears some similarities with D. Leivant’s ramified theories for finitary inductive definitions.
متن کامل